Rainbow Matchings in Properly Colored Bipartite Graphs
نویسندگان
چکیده
Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition ( X , Y ) and . We show that if = G k 3 7 max , 4 k X Y , then G has a rainbow coloring of size at least 3 4 k .
منابع مشابه
Rainbow matchings and cycle-free partial transversals of Latin squares
In this paper we show that properly edge-colored graphs Gwith |V (G)| ≥ 4δ(G) − 3 have rainbow matchings of size δ(G); this gives the best known bound for a recent question of Wang. We also show that properly edge-colored graphs Gwith |V (G)| ≥ 2δ(G) have rainbow matchings of size at least δ(G) − 2δ(G)2/3. This result extends (with a weaker error term) the well-known result that a factorization...
متن کاملRainbow Matchings in Properly Edge Colored Graphs
Let G be a properly edge colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let δ denote the minimum degree of G. We show that if |V (G)| ≥ 8δ 5 , then G has a rainbow matching of size at least ⌊ 5 ⌋. We also prove that if G is a properly colored triangle-free graph, then G has a rainbow matching of size at least ⌊ 3 ⌋.
متن کاملRainbow matchings and partial transversals of Latin squares
In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A matching is called rainbow if its edges have different colors. The minimum degree of a graph is denoted by δ(G). We show that properly edge colored graphs G with |V (G)| ≥ 4δ(G) − 3 have rainbow matchings of size δ(G), this gives the best know...
متن کاملRainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs
A rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function f(δ) such that a properly edgecolored graph G with minimum degree δ and order at least f(δ) must have a rainbow matching of size δ. We answer this question in the affirmative; an extremal approach yields that f(δ) = 98δ/23 < 4.27δ suffices. Furthermore, we giv...
متن کاملOn rainbow matchings in bipartite graphs
We present recent results regarding rainbow matchings in bipartite graphs. Using topological methods we address a known conjecture of Stein and show that if Kn,n is partitioned into n sets of size n, then a partial rainbow matching of size 2n/3 exists. We generalize a result of Cameron and Wanless and show that for any n matchings of size n in a bipartite graph with 2n vertices there exists a f...
متن کامل